Swarming on Random Graphs II
نویسندگان
چکیده
منابع مشابه
Swarming on Random Graphs II
We consider an individual-based model where agents interact over a random network via firstorder dynamics that involve both attraction and repulsion. In the case of all-to-all coupling of agents in Rd this system has a lowest energy state in which an equal number of agents occupy the vertices of the d-dimensional simplex. The purpose of this paper is to study the behavior of this model when the...
متن کاملSwarming on Random Graphs
We consider a compromise model in one dimension in which pairs of agents interact through first-order dynamics that involve both attraction and repulsion. In the case of all-to-all coupling of agents, this system has a lowest energy state in which half of the agents agree upon one value and the other half agree upon a different value. The purpose of this paper is to study the behavior of this c...
متن کاملOn common neighborhood graphs II
Let G be a simple graph with vertex set V (G). The common neighborhood graph or congraph of G, denoted by con(G), is a graph with vertex set V (G), in which two vertices are adjacent if and only if they have at least one common neighbor in G. We compute the congraphs of some composite graphs. Using these results, the congraphs of several special graphs are determined.
متن کاملRandom Electrical Networks on Complete Graphs Ii: Proofs
Geoffrey Grimmett and Harry Kesten Abstra t. This paper contains the proofs of Theorems 2 and 3 of the article entitled Random electrical networks on complete graphs, written by the same authors and published in the Journal of the London Mathematical Society, vol. 30 (1984), pp. 171–192. The current paper was written in 1983 but was not published in a journal, although its existence was announc...
متن کاملRandom Walks on Random Graphs
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2014
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-014-0923-0